Herbrand Theorems for Substructural Logics
نویسندگان
چکیده
Herbrand and Skolemization theorems are obtained for a broad family of first-order substructural logics. These logics typically lack equivalent prenex forms, a deduction theorem, and reductions of semantic consequence to satisfiability. The Herbrand and Skolemization theorems therefore take various forms, applying either to the left or right of the consequence relation, and to restricted classes of formulas.
منابع مشابه
Herbrand Theorems and Skolemization for Prenex Fuzzy Logics
Approximate Herbrand theorems are established for first-order fuzzy logics based on continuous t-norms, and used to provide proof-theoretic proofs of Skolemization for their Prenex fragments. Decidability and complexity results for particular fragments are obtained as consequences.
متن کاملClosure Operators and Complete Embeddings of Residuated Lattices
In this paper, a theorem on the existence of complete embedding of partially ordered monoids into complete residuated lattices is shown. From this, many interesting results on residuated lattices and substructural logics follows, including various types of completeness theorems of substructural logics.
متن کاملTitle Closure operators and complete embeddings of residuated lattices
In this paper, a theorem on the existence of complete embedding of partially ordered monoids into complete residuated lattices is shown. From this, many interesting results on residuated lattices and substructural logics follows, including various types of completeness theorems of substructural logics.
متن کاملHerbrand theorems in arbitrary institutions
The basic logic programming semantic concepts, query, solutions, solution forms, and the fundamental results such as Herbrand theorems, are developed over any logical system, formalised as institution, by employing ‘institution-independent’ concepts of variable, substitution, quantifier, and atomic formulae. This sets semantical foundations for an uniform development of logic programming over a...
متن کاملHerbrand Theorems: the Classical and Intuitionistic Cases
A unified approach is applied for the construction of sequent forms of the famous Herbrand theorem for first-order classical and intuitionistic logics without equality. The forms do not explore skolemization, have wording on deducibility, and as usual, provide a reduction of deducibility in the first-order logics to deducibility in their propositional fragments. They use the original notions of...
متن کامل